Periodic gossiping on trees
نویسندگان
چکیده
In periodic gossip schemes, the calls are periodically repeated according to a proper coloring of the edges of the underlying graph with integers 1; 2;. .. ; c. One period consists of c consecutive rounds 1;. .. ; c each containing time-parallel bidirectional calls on all edges with the same color. The problem is to design colorings which minimize the number of periods until gossiping is completed. We present an algorithm yielding "reasonable" colorings for trees, and discuss cases where it produces an optimal coloring. For these cases, the periodic gossip time, i.e. the minimum number of periods can be computed from the algorithm.
منابع مشابه
Periodic Gossiping in Back-to-back Trees
The d-ary back-to-back tree of height k, BBT k d , consists of two complete d-ary trees of height k the leaves of which are identiied. For a proper coloring of the edges of BBT k d with c d + 1 colors, we consider periodic gossiping, i.e. full-duplex all-to-all broadcasting in the 1-port model where communication is made on a link of color i at any time (round) i mod c. We present a coloring fo...
متن کاملApproximation algorithms for information dissemination problems
Broadcasting and gossiping are known to be NP hard problems This paper deals with approximation algorithms for such problems We consider both round complexity and step complexity in the telephone model After an overview of previously derived approximation algorithms we present new strategies for broadcasting and gossiping in any graphs Broadcasting strategies are based on the construction of ed...
متن کاملOn Periodic Gossiping with an Optimal Weight
By the distributed averaging problem is meant the problem of computing the average value ȳ of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each it...
متن کاملNote on Optimal Gossiping in Some Weak-Connected Graphs
The problems of gossiping and broadcasting in one-way communication mode are investigated. Optimal algorithms for gossip problem are known only for the complete graphs, paths, some simple trees, and cycles. In this paper some lower bounds on gossiping in graphs with bridges or with edge disjoint cycles are proved. A direct consequence of these lower bounds are optimal gossip algorithms for some...
متن کاملGossiping with Multiple Sends and Receives
We consider the problem of gossiping in several important networks in as few rounds as possible. During a single round, each processor may send an unlimited size message to k neighbors, or receive messages from k neighbors, but a processor cannot both send and receive during the same round. The network architectures we consider are trees, cycles, grids, hypercubes, and toroidal (or " wrap-aroun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 53 شماره
صفحات -
تاریخ انتشار 1994